Symbolic Coloured SCC Decomposition

Abstract Problems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous the number of both vertices and colours. Given such a graph, original problem frequently translates to detection graph’s strongly connected components, which is challenging at this scale. We propose new, symbolic algorithm that computes all monochromatic components an graph. In worst case, performs $$O(p\cdot n\cdot \log n)$$ O ( p · n log ) steps, where p colours n vertices. evaluate experimental implementation based on Binary Decision Diagrams (BDDs) large (up $$2^{48}$$ 2 48 ) coloured graphs produced by models appearing systems biology.